package leetcode.sort;

import leetcode.sort.common.SortUtils;

import java.util.Arrays;

public class SortDemo {

    public static void main(String[] args) {
        int[] array = {19, 21, 23, 14, 35, 49, 37, 59, 10, 16};

        // 冒泡排序
        SortUtils.bubbleSort(array);
        System.out.println("冒泡排序结果===================");
        System.out.println(Arrays.toString(array));

        int[] array2 = {19, 21, 23, 14, 35, 49, 37, 59, 10, 16};
        // 选择排序
        SortUtils.selectSort(array2);
        System.out.println("选择排序结果===================");
        System.out.println(Arrays.toString(array2));

        int[] array3 = {19, 21, 23, 14, 35, 49, 37, 59, 10, 16};
        // 插入排序
        SortUtils.insertSort(array3);
        System.out.println("插入排序结果===================");
        System.out.println(Arrays.toString(array3));

//        int[] array4 = {19, 21, 23, 14, 35, 49, 37, 59, 10, 16};
//        // 快速排序
//        SortUtils.quickSort(array4, 0, array4.length - 1);
//        System.out.println("快速排序结果===================");
//        System.out.println(Arrays.toString(array4));

        // 希尔排序

        // 堆排序

        // 桶排序
    }

}
